A New Triangulation for Simplicial Algorithms
نویسندگان
چکیده
منابع مشابه
A New Triangulation for Simplicial Algorithms
Triangulations are used in simplicial algorithms to nd the xed points of continuous functions or upper semi-continuous mappings; applications arise from economics and optimization. The performance of simplicial algorithms is very sensitive to the triangulation used. Using a facetal description, we modify Dang's D 1 triangulation to obtain a more eecient triangulation of the unit hypercube in R ...
متن کاملNew methods for constructing shellable simplicial complexes
A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...
متن کاملa new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولOn algorithms for simplicial depth
Simplicial depth is a way to measure how deep a point is among a set of points. EEcient algorithms to compute it are important to the usefulness of its applications, such as in multivariate analysis in statistics. A straightforward method takes O(n d+1) time when the points are in d-dimensional space. We discuss an algorithm that takes O(n 2) time when the points are in three-dimensional space,...
متن کاملA New Method for Quadtree Triangulation
The aim of the study is to increase the accuracy of a terrain triangulation while maintaining or reducing the number of triangles. To this end, a new non-trivial algorithm for quadtree triangulation is proposed. The proposed algorithm includes: i) a resolution parameters calculation technique and ii) three error metric calculation techniques. Simulation software is also devised to apply the pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 1993
ISSN: 0895-4801,1095-7146
DOI: 10.1137/0406013